Detecting Dynamic Traffic Assignment Capacity Paradoxes in Saturated Networks
نویسندگان
چکیده
منابع مشابه
Detecting Dynamic Traffic Assignment Capacity Paradoxes in Saturated Networks
Creation of a new link or increase in capacity of an existing link can reduce the efficiency of a congested network as measured by the total travel cost. This phenomenon, of which an extreme example is given by Braess’s paradox, has been examined in conventional studies within the framework of static assignment. For dynamic traffic assignment, which makes account of the effect of congestion thr...
متن کاملDetecting Dynamic Traffic Assignment Capacity Paradoxes: Analysis of Non-Saturated Networks
In Akamatsu and Heydecker (2003), we presented a necessary and sufficient condition for the occurrence of capacity paradoxes in general saturated networks, in which there is a queue on each link. The present paper extends that analysis to the more usual case of non-saturated networks, in which there are queues on some links but not on others. First we formulate dynamic user equilibrium (DUE) as...
متن کاملRobust Dynamic Traffic Assignment under Demand and Capacity Uncertainty
In this note we discuss the system optimum dynamic traffic assignment (SO-DTA) problem in the presence of time-dependent uncertainty on the demands and link capacities. We start from the deterministic linear programming formulation of the SO-DTA problem introduced by Ziliaskopoulos in [14], and then consider a robust version of the decision problem where the total travel time must be minimized ...
متن کاملDetecting Active Bot Networks Based on DNS Traffic Analysis
Abstract—One of the serious threats to cyberspace is the Bot networks or Botnets. Bots are malicious software that acts as a network and allows hackers to remotely manage and control infected computer victims. Given the fact that DNS is one of the most common protocols in the network and is essential for the proper functioning of the network, it is very useful for monitoring, detecting and redu...
متن کاملWavelength Assignment for Dynamic Traffic in Multi-fiber WDM Networks
We propose an on-line wavelength assignment algorithm for multi-fiber WDM networks, in which lightpaths are established and released dynamically. For a given number of fibers per link and number of wavelengths per fiber, the algorithm aims to minimize the blocking probability. It may also be used to reduce the number of wavelengths required for a given tolerable blocking probability. Simulation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Science
سال: 2003
ISSN: 0041-1655,1526-5447
DOI: 10.1287/trsc.37.2.123.15245